Probabilistic Validation of Homology Computations for Nodal Domains
نویسنده
چکیده
Homology has long been accepted as an important computable tool for quantifying complex structures. In many applications, these structures arise as nodal domains of real-valued functions and are therefore amenable only to a numerical study based on suitable discretizations. Such an approach immediately raises the question of how accurate the resulting homology computations are. In this paper, we present a probabilistic approach to quantifying the validity of homology computations for nodal domains of random fields in one and two space dimensions, which furnishes explicit probabilistic a priori bounds for the suitability of certain discretization sizes. We illustrate our results for the special cases of random periodic fields and random trigonometric polynomials.
منابع مشابه
Probabilistic and Numerical Validation of Homology Computations for Nodal Domains
Homology has long been accepted as an important computable tool for quantifying complex structures. In many applications these structures arise as nodal domains of real-valued functions and are therefore amenable only to a numerical study, based on suitable discretizations. Such an approach immediately raises the question of how accurate the resulting homology computations are. In this paper we...
متن کاملVerified Homology Computations for Nodal Domains
Homology has long been accepted as an important computational tool for quantifying complex structures. In many applications these structures arise as nodal domains of real-valued functions and are therefore amenable only to a numerical study based on suitable discretizations. Such an approach immediately raises the question of how accurately the resulting homology can be computed. In this paper...
متن کاملar X iv : n lin / 0 30 50 20 v 1 [ nl in . C D ] 1 2 M ay 2 00 3 Nodal domains on quantum graphs 8 February 2008
We consider the real eigenfunctions of the Schrödinger operator on graphs, and count their nodal domains. The number of nodal domains fluctuates within an interval whose size equals the number of bonds B. For well connected graphs, with incommensurate bond lengths, the distribution of the number of nodal domains in the interval mentioned above approaches a Gaussian distribution in the limit whe...
متن کاملar X iv : n lin . C D / 0 30 50 20 v 1 1 2 M ay 2 00 3 Nodal domains on quantum graphs 9 July 2003
We consider the real eigenfunctions of the Schrödinger operator on graphs, and count their nodal domains. The number of nodal domains fluctuates within an interval whose size equals the number of bonds B. For well connected graphs, with incommensurate bond lengths, the distribution of the number of nodal domains in the interval mentioned above approaches a Gaussian distribution in the limit whe...
متن کاملNodal domain distributions for quantum maps
The statistics of the nodal lines and nodal domains of the eigenfunctions of quantum billiards have recently been observed to be fingerprints of the chaoticity of the underlying classical motion by Blum et al These statistics were shown to be computable from the random wave model of the eigenfunctions. We here study the analogous problem for chaotic maps whose phase space is the two-torus. We s...
متن کامل